Pre-Expansivity in Cellular Automata
نویسندگان
چکیده
We introduce the property of pre-expansivity for cellular automata (CA): it is the property of being expansive on asymptotic pairs of configurations (i.e. configurations that differ in only finitely many positions). Pre-expansivity therefore lies between expansivity and pre-injectivity, two important notions of CA theory. We show that there exist one-dimensional pre-expansive CAs which are not (positively) expansive and they can be chosen reversible. We show however that no bi-dimensional CA which is linear over an Abelian group can be preexpansive. We also consider the finer notion of k-expansivity (expansivity over pairs of configurations with exactly k differences) and show examples of linear CA in dimension 2 and on the free group that are k-expansive depending on the value of k, whereas no (positively) expansive CA exists in this setting.
منابع مشابه
2D cellular automata: expansivity and decidability issues
In this paper we introduce the notion of quasi-expansivity for 2D CA and we show that it shares many properties with expansivity (that holds only for 1D CA). Similarly, we introduce the notions of quasi-sensitivity and prove that the classical dichotomy theorem holds in this new setting. Moreover, we show a tight relation between closingness and openness for 2D CA. Finally, the undecidability o...
متن کامل2D cellular automata: dynamics and undecidability
In this paper we introduce the notion of quasi-expansivity for 2D CA and we show that it shares many properties with expansivity (that holds only for 1D CA). Similarly, we introduce the notions of quasisensitivity and prove that the classical dichotomy theorem holds in this new setting. Moreover, we show a tight relation between closingness and openness for 2D CA. Finally, the undecidability of...
متن کاملThe Dynamics of Cellular Automata in Shift-Invariant Topologies
We study the dynamics of cellular automata, and more specifically their transitivity and expansivity, when the set of configurations is endowed with a shift-invariant (pseudo-)distance. We first give an original proof of the non-transitivity of cellular automata when the set of configurations is endowed with the Besicovitch pseudo-distance. We then show that the Besicovitch pseudo-distance indu...
متن کاملCombinatorial constructions associated to the dynamics of one-sided cellular automata
In this paper we study combinatorial constructions which lead to one-sided invertible cellular automata with di5erent dynamical behavior: equicontinuity, existence of equicontinuous points but not equicontinuity, sensitivity and expansivity. In particular, we provide a simple characterization of the class of equicontinuous invertible one-sided cellular automata and we construct families of expa...
متن کاملFast Cellular Automata Implementation on Graphic Processor Unit (GPU) for Salt and Pepper Noise Removal
Noise removal operation is commonly applied as pre-processing step before subsequent image processing tasks due to the occurrence of noise during acquisition or transmission process. A common problem in imaging systems by using CMOS or CCD sensors is appearance of the salt and pepper noise. This paper presents Cellular Automata (CA) framework for noise removal of distorted image by the salt an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1603.07215 شماره
صفحات -
تاریخ انتشار 2016